Predicting protein function via downward random walks on a gene ontology

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supplementary file of ‘Prediction protein functions via downward random walks on a gene ontology’

random walks on a gene ontology’ Guoxian Yu1,2,∗, Hailong Zhu3,∗, Carlotta Domeniconi and Jiming Liu College of Computer and Information Sciences, Southwest University, Chongqing, China 2 Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012, China. 3 Department of Computer Science, Hong Kong Baptist University, Hong Kong D...

متن کامل

Amenability via random walks

We use random walks to show that the Basilica group is amenable, answering an open question of Grigorchuk and Żuk. Our results separate the class of amenable groups from the closure of subexponentially growing groups under the operations of group extension and direct limits; these classes are separated even within the realm of finitely presented groups.

متن کامل

Using the Gene Ontology Hierarchy when Predicting Gene Function

The problem of multilabel classification when the labels are related through a hierarchical categorization scheme occurs in many application domains such as computational biology. For example, this problem arises naturally when trying to automatically assign gene function using a controlled vocabularies like Gene Ontology. However, most existing approaches for predicting gene functions solve in...

متن کامل

Oblivious Routing via Random Walks

We present novel oblivious routing algorithms for both splittable and unsplittable multicommodity flow. Our algorithm for minimizing congestion for unsplittable multicommodity flow is the first oblivious routing algorithm for this setting. As an intermediate step towards this algorithm, we present a novel generalization of Valiant’s classical load balancing scheme for packet-switched networks t...

متن کامل

An Ontology Matching Approach Based on Affinity-Preserving Random Walks

Ontology matching is the process of finding semantic correspondences between entities from different ontologies. As an effective solution to linking different heterogeneous ontologies, ontology matching has attracted considerable attentions in recent years. In this paper, we propose a novel graphbased approach to ontology matching problem. Different from previous work, we formulate ontology mat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Bioinformatics

سال: 2015

ISSN: 1471-2105

DOI: 10.1186/s12859-015-0713-y